Involutions on Generating Functions
نویسندگان
چکیده
We study a family of involutions on the space of sequences. Many arithmetically or combinatorially interesting sequences appear as eigensequences of the involutions. We develop new tools for studying sequences using these involutions.
منابع مشابه
Restricted 132 - Involutions
We study generating functions for the number of involutions of length n avoiding (or containing exactly once) 132 and avoiding (or containing exactly once) an arbitrary permutation τ of length k. In several interesting cases these generating functions depend only on k and can be expressed via Chebyshev polynomials of the second kind. In particular, we show that involutions of length n avoiding ...
متن کاملJa n 20 04 Involutions Restricted by 3412 , Continued Fractions , and Chebyshev Polynomials
We study generating functions for the number of involutions, even involutions, and odd involutions in Sn subject to two restrictions. One restriction is that the involution avoid 3412 or contain 3412 exactly once. The other restriction is that the involution avoid another pattern τ or contain τ exactly once. In many cases we express these generating functions in terms of Chebyshev polynomials o...
متن کاملul 2 00 3 Restricted 3412 - Avoiding Involutions : Continued Fractions , Chebyshev Polynomials and Enumerations ∗
Several authors have examined connections among restricted permutations, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for involutions which avoid 3412. Our results include a recursive procedure for computing the generating function for involutions which avoid 3412 and any set of additional patterns. We use our results to gi...
متن کاملTwo Involutions for Signed Excedance Numbers
Two involutions on permutations and derangements are constructed. They lead to a direct evaluation of some signed Eulerian polynomials on permutations and derangements. The latter formulas, combined with the exponential formula, give a new derivation of the corresponding generating functions.
متن کاملExcedance Number for Involutions in Complex Reflection Groups
We define the excedance number on the complex reflection groups and compute its multidistribution with the number of fixed points on the set of involutions in these groups. We use some recurrences and generating functions manipulations to obtain our results.
متن کامل